s-Numbers in information-based complexity

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of Integral Equations and Relations to s-Numbers

The complexity of computing a functional of the solution of a Fred-holm integral equation is studied. We show that the estimate of the information complexity is equivalent to that of Gelfand numbers of a certain mapping. Upper and lower estimates as well as open problems are discussed.

متن کامل

Information-based Complexity and Information-based Optimization

This is an article that will appear in the Encyclopedia of Optimization (Kluwer, 2000). It concerns optimization in two senses. The first is that informaion-based complexity (IBC) is the study of the minimal computational resources to solve continuous mathematical problems. The second is that the computational complexity of optimization problems is one of the areas studied in IBC. We discuss IB...

متن کامل

Evolution of Information and Complexity in an Ever-Expanding Universe

Using the usual definitions of information and entropy in quantum gravity and statistical mechanics and the existing views about the relation between information and complexity, we examine the evolution of complexity in an ever expanding universe.

متن کامل

Complexity-Based Information Assurance

Unless vulnerabilities can be identified and measured, the information assurance of a system can never be properly designed or guaranteed. Results from a study on complexity evolving within an information system using Mathematica, Swarm, and a new Java complexity probe toolkit are presented in this paper. An underlying definition of information security is hypothesized based upon the attacker a...

متن کامل

3D Scene and Object Classification Based on Information Complexity of Depth Data

In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complexity

سال: 1990

ISSN: 0885-064X

DOI: 10.1016/0885-064x(90)90011-2